Bounds on the maximum-likelihood decoding error probability of low-density parity-check codes

We derive both upper and lower bounds on the decoding error probability of ML decoded LDPC codes. The results hold for any binary-input symmetric-output channel. Our results indicate that for various appropriately chosen ensembles of LDPC codes, reliable communication is possible up to channel capacity. However, the ensemble averaged decoding error probability decreases polynomially, and not exponentially. The lower and upper bounds coincide asymptotically, thus showing the tightness of the bounds. However, for ensembles with suitably chosen parameters, the error probability of almost all codes is exponentially decreasing, with an error exponent that can be set arbitrarily close to the standard random coding exponent. Index Terms Code ensembles, Error exponent, Low density parity check (LDPC) codes.